Analyzing synchronous and asynchronous parallel distributed genetic algorithms
نویسندگان
چکیده
منابع مشابه
Analyzing synchronous and asynchronous parallel distributed genetic algorithms
Parallel genetic algorithms (PGAs) have been traditionally used to extend the power of serial GAs, since they often can be tailored to provide a larger efficiency on complex search problems. In a PGA several subalgorithms cooperate in parallel to solve the problem. This high-level definition has leaded to a considerable number of different implementations that preclude direct comparisons and kn...
متن کاملAnalyzing Synchronous Distributed Algorithms
Synchronous distributed systems are those in which there is assumed to be a known upper bound on each processing step, a known upper bound on message transmission and processes have perfectly synchronized physical clocks. When these assumptions hold for a system, execution can be arranged to proceed in synchronous rounds. This paper is a tutorial on modeling and analyzing these systems using fi...
متن کاملAn Analysis of Synchronous and Asynchronous Parallel Distributed Genetic Algorithms with Structured and Panmictic Islands
In a parallel genetic algorithm (PGA) several communicating nodal GAs evolve in parallel to solve the same problem. PGAs have been traditionally used to extend the power of serial GAs since they often can be tailored to provide a larger efficiency on complex search tasks. This has led to a considerable number of different models and implementations that preclude direct comparisons and knowledge...
متن کاملComparing Synchronous and Asynchronous Cellular Genetic Algorithms
This paper presents a comparative study of several asynchronous policies for updating the population in a cellular genetic algorithm (cGA). Cellular GA’s are regular GA’s with the important exception that individuals are placed in a given geographical distribution (usually a 2-d grid). Operators are applied locally on a set made of each individual and the surrounding neighbors, thus promoting i...
متن کاملParallel synchronous and asynchronous iterative algorithms for Procrustes - type problems ∗
submitted to PMAA’06 Giorgos Kollias CEID, Univ. of Patras GREECE [email protected] Efstratios Gallopoulos CEID, Univ. of Patras GREECE [email protected] Daniel B. Szyld Dept. Math., Temple Univ. USA [email protected] In areas such as Information Retrieval, Pattern Recognition and Image Processing, many data analysis problems contain computational kernels of the form
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Future Generation Computer Systems
سال: 2001
ISSN: 0167-739X
DOI: 10.1016/s0167-739x(99)00129-6